Genetic Redundancy: Desirable or Problematic for Evolutionary Adaptation?

نویسنده

  • R. Shipman
چکیده

Evolution is commonly viewed as a process of hill climbing on a fitness landscape. A major problem with such a view is the presence of local optima; sub-optimal regions of the landscape from which no further progress is possible. There is an increasing amount of evidence [3,4,7], however, that the presence of large degrees of redundancy in the genome may alleviate this problem through the creation of neutral networks; sets of genotypes at the same level of fitness that are connected by single point mutations. These networks allow drift at the same fitness level and hence may increase the reliability of the evolutionary process by allowing the exploration of larger portions of genotype space. The presence, or otherwise, of genetic redundancy could thus be an important concern in the design of artificial evolutionary systems. This paper explores the effects of genetic redundancy in the context of an evolutionary robotics experiment. Neural network control systems are evolved for a simple navigation task and the speed and reliability of the evolutionary process ascertained for differing levels of redundancy. Evolutionary progress is found to halt far more readily as the degree of redundancy is reduced indicating a greater probability of entrapment at local optima.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Memtic genetic algorithm for a redundancy allocation problem

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

متن کامل

Exploring tradeoffs in pleiotropy and redundancy using evolutionary computing

Evolutionary computation algorithms are increasingly being used to solve optimization problems as they have many advantages over traditional optimization algorithms. In this paper we use evolutionary computation to study the trade-off between pleiotropy and redundancy in a client-server based network. Pleiotropy is a term used to describe components that perform multiple tasks, while redundancy...

متن کامل

Redundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies

To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...

متن کامل

The use of neutral genotype-phenotype mappings for improved evolutionary search

In natural systems, the organism or phenotype is the result of a complex developmental process that is played out as the genetic information is interpreted. This is in stark contrast to many artificial evolutionary systems in which the phenotype is represented directly in the genetic information and there is no such development. As well as overcoming the obvious practical impossibility of direc...

متن کامل

Reliability Optimization for Complicated Systems with a Choice of Redundancy Strategies (TECHNICAL NOTE)

Redundancy allocation is one of the common techniques to increase the reliability of the bridge systems. Many studies on the general redundancy allocation problems assume that the redundancy strategy for each subsystem is predetermined and fixed. In general, active redundancy has received more attention in the past. However, in real world, a particular system design contains both active and col...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999